Optimization of E-Service Solutions with the Systems of Servers Library

نویسندگان

  • Vadim E. Kotov
  • Holger Trinks
چکیده

e-service systems, system integration, system modeling, system analysis and optimization, Communicating Structures Library, services, servers, service partitioning, load balancing, genetic algorithms The report describes a modeling library for analysis and optimization of distributed service systems: enterprise computing infrastructures, E-commerce and E-service systems. The library uses a small number of basic notions, such as service, server, cluster (of servers), clients and message, which allow us to describe, analyze and optimize various system configurations and deployment of services among servers. The service requests and responses are modeled by messages traveling in the system and using the system common resources, such as network bandwidth and cache space. Clients send their requests for services to servers, which either return responses or may issue secondary requests for other services. The messages can form complex activities such as transactions (sessions). To find optimal deployments of services among servers, different partition policies can be used including partitions based on genetic algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment

Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...

متن کامل

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY

This paper analyzes a controllable discrete-time machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the system a...

متن کامل

Fuzzy Hierarchical Location-Allocation Models for Congested Systems

There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...

متن کامل

Maximal Benefit Location Problem for A Congested System

Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000